/*
2021-7-23
https://www.acwing.com/problem/content/342/
*/

 #include<cstring>
#include<iostream>
#include<algorithm>
#include<deque>

using namespace std;
const int N=1005,M=20005;
int h[N],ne[M],e[M],w[M],idx;
int dist[N];
bool st[N];
int n,m,k;
deque<int>q;

void add(int a,int b,int c)
{
    e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}

bool check(int bound)
{
    memset(dist,0x3f,sizeof dist);
    memset(st,0,sizeof st);
    dist[1]=0;
    
    q.push_back(1);
    
    while(q.size())
    {
        auto t=q.front();
        q.pop_front();
        
        if(st[t]) continue;
        st[t]=true;
        
        for(int i=h[t];~i;i=ne[i])
        {
            int j=e[i],d=(w[i]>bound);
            if(dist[j]>dist[t]+d)
            {
                dist[j]=dist[t]+d;
                if(!d) q.push_front(j);
                else q.push_back(j);
            }
        }
        
    }
    return dist[n]<=k;
}

int main()
{
    cin>>n>>m>>k;
    memset(h,-1,sizeof h);
    while(m--)
    {
        int a,b,l;
        cin>>a>>b>>l;
        add(a,b,l),add(b,a,l);
    }
    
    int l=0,r=1e6+1;
    
    while(l<r)
    {
        int mid=(l+r)>>1;
        if(check(mid)) r=mid;
        else l=mid+1;
    }
    
    if(r==1e6+1) puts("-1");
    else cout<<r<<endl;
    
    return 0;
}
